Local Strongly Arc-Connectivity in Regular Bipartite Digraphs
نویسندگان
چکیده
منابع مشابه
On Restricted Arc-connectivity of Regular Digraphs
The restricted arc-connectivity λ′ of a strongly connected digraph G is the minimum cardinality of an arc cut F in G such that every strongly connected component of G−F contains at least two vertices. This paper shows that for a d-regular strongly connected digraph with order n and diameter k ≥ 4, if λ′ exists, then λ′(G) ≥ min { (n − dk−1)(d− 1) dk−1 + d− 2 , 2d− 2 } As consequences, the restr...
متن کاملClassification of Regular Digraphs, Normally Regular Digraphs, and Strongly Regular Digraphs
We use an exhaustive generation with isomorph-rejection to classify three types of structured digraphs. The first type is the class of regular digraphs where each vertex has the same number of out-neighbors and inneighbors. The second type is the class of normally regular digraphs introduced by Jørgensen. In these digraphs, the number of common out-neighbors (or inneighbors) of vertices x and y...
متن کاملBipartite Graphs and Digraphs with Maximum Connectivity
Recently, some sufficient conditions for a digraph to have maximum connectivity or high superconnectivity have been given in terms of a new parameter which can be thought of as a generalization of the girth of a graph. In this paper similar results are derived for bipartite digraphs and graphs showing that, in this case, all the known conditions can be improved. As a corollary, it is shown that...
متن کاملSupereulerian Digraphs with Large Arc-Strong Connectivity
Let D be a digraph and let λ(D) be the arc-strong connectivity of D, and α′(D) be the size of a maximum matching of D. We proved that if λ(D) ≥ α′(D) > 0, then D has a spanning eulerian subdigraph. C © 2015 Wiley Periodicals, Inc. J. Graph Theory 81: 393–402, 2016
متن کاملOn Arc Connectivity of Direct-Product Digraphs
Various product operations are employed for constructing larger networks from smaller ones, among which direct-product operation is the most frequently employed one. The direct product of two graphs G1 andG2, denoted byG1×G2, is defined on vertex set V G1 ×V G2 , where two vertices x1, x2 and y1, y2 are adjacent to each other in G1 × G2 if and only if x1y1 ∈ E G1 and x2y2 ∈ E G2 . Other names f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1993
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1064